Formulas for various domination numbers of products of paths and cycles
نویسندگان
چکیده
The existence of a constant time algorithm for solving different domination problems on the subclass of polygraphs, rotagraphs and fasciagraphs, is shown by means of path algebras. As these graphs include products (the Cartesian, strong, direct, lexicographic) of paths and cycles, we implement the algorithm to get formulas in the case of the domination numbers, the Roman domination numbers and the independent domination numbers of products of paths and cycles where the size of one factor is fixed, i.e. independently of the size of the second factor. We also show that the values of the investigated graph invariants on the fasciagraphs and the rotagraphs with the same monograph can only differ for a constant value. AMS subject classifications: 05C25, 05C69, 05C85, 68R10
منابع مشابه
A Note on the Domination Number of the Cartesian Products of Paths and Cycles
Using algebraic approach we implement a constant time algorithm for computing the domination numbers of the Cartesian products of paths and cycles. Closed formulas are given for domination numbers γ(Pn Ck) (for k ≤ 11, n ∈ N) and domination numbers γ(Cn Pk) and γ(Cn Ck) (for k ≤ 7, n ∈ N).
متن کاملOn the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملRoman Domination Number of the Cartesian Products of Paths and Cycles
Roman domination is a historically inspired variety of general domination such that every vertex is labeled with labels from {0, 1, 2}. Roman domination number is the smallest of the sums of labels fulfilling condition that every vertex, labeled 0, has a neighbor, labeled 2. Using algebraic approach we give O(C) time algorithm for computing Roman domination number of special classes of polygrap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 137 شماره
صفحات -
تاریخ انتشار 2018